A Review of Scheduling Problems with Bounded Processing/Setup Times
نویسندگان
چکیده
The scheduling literature reveals that majority of the studied problems are for deterministic case where all parameters jobs known in advance and fixed. However, some real-world environments, assumption fixed is not valid since job uncertain. An uncertain parameter can be modelled as a random variable within interval with lower upper bounds, called bounded. objective this paper to review investigated bounded processing or setup times. reviewed, addressed analysed, classified based on shop environments (single machine, parallel flowshop, shop), performance measures, approach taken papers solve considered problem, interval/bounded times Some future research opportunities processing/setup presented.
منابع مشابه
Approximating Interval Scheduling Problems with Bounded Profits
We consider the Generalized Scheduling Within Intervals (GSWI) problem: given a set J of jobs and a set I of intervals, where each job j ∈ J has in interval I ∈ I length (processing time) `j,I and profit pj,I , find the highest-profit feasible schedule. The best approximation ratio known for GSWI is (1/2 − ε). We give a (1 − 1/e − ε)approximation scheme for GSWI with bounded profits, based on t...
متن کاملA survey of scheduling problems with setup times or costs
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. Th...
متن کاملFlowshop Scheduling with Random and Bounded Setup Times
The two-machine permutation flowshop scheduling problem to minimize makespan or total completion time criterion is addressed where setup times are considered to be separate from processing times. Setup times are relaxed to be random variables as opposed to the common assumption in the literature that setup times are exactly known (deterministic) in advance. The probability distributions of setu...
متن کاملَA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملVariants of Multi-resource Scheduling Problems with Equal Processing Times
We tackle the problem of non-preemptive scheduling of a set of tasks of duration p over m machines with given release and deadline times. We present a polynomial time algorithm as a generalization to this problem, when the number of machines fluctuates over time. Further, we consider different objective functions for this problem. We show that if an arbitrary function cost ci(t) is associated t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Research in Engineering Innovation
سال: 2023
ISSN: ['2682-8499']
DOI: https://doi.org/10.55057/ijarei.2022.4.4.6